Verified Analysis of List Update Algorithms
نویسندگان
چکیده
This paper presents a machine-verified analysis of a number of classical algorithms for the list update problem: 2-competitiveness of move-to-front, the lower bound of 2 for the competitiveness of deterministic list update algorithms and 1.6-competitiveness of the randomized COMB algorithm, the best randomized list update algorithm known to date. The analysis is verified with help of the theorem prover Isabelle; some low-level proofs could be automated. 1998 ACM Subject Classification F.3.1 Specifying and Verifying Programs and F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملA Competitive Analysis of the List Update
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two diierent models of lookahead and study the list update problem using these models. We develop lower bounds on the competitiveness that can be achieved ...
متن کاملList Update with Locality of Reference: MTF Outperforms All Other Algorithms
It has been observed that in practice, typical request sequences for the list update problem exhibit a certain degree of locality of reference. We first extend the locality of reference model for the paging problem due to Albers et al [STOC 2002/JCSS 2005] to the domain of list update; this addresses the open question of defining an appropriate model for capturing locality of reference in the c...
متن کاملOn List Update and Work Function Algorithms
The list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the work function algorithm, has constant competitive ratio for list update. In the process, we present a new formulation of the well-known \list factoring" technique in terms of a partial...
متن کاملOff-Line Algorithms for the List Update Problem
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to an implementation of an optimumalgorithm which runs in time O(2 n n!m), where n is the length of the list and m is the number or requests. The previous best algorith...
متن کامل